Minimal counterexamples for linear-time probabilistic verification
نویسندگان
چکیده
منابع مشابه
Minimal counterexamples for linear-time probabilistic verification
Counterexamples for property violations have a number of important applications like supporting thedebugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement.In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markovdecision processes as counterexamples for violated ω-regular propertie...
متن کاملCounterexamples for Timed Probabilistic Reachability
The inability to provide counterexamples for the violation of timed probabilistic reachability properties constrains the practical use of CSL model checking for continuous time Markov chains (CTMCs). Counterexamples are essential tools in determining the causes of property violations and are required during debugging. We propose the use of explicit state model checking to determine runs leading...
متن کاملcounterexamples in a−minimal sets
several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.
متن کاملMinimal counterexamples and discharging method
Recently, the author found that there is a common mistake in some papers by using minimal counterexample and discharging method. We first discuss how the mistake is generated, and give a method to fix the mistake. As an illustration, we consider total coloring of planar or toroidal graphs, and show that: if G is a planar or toroidal graph with maximum degree at most κ − 1, where κ ≥ 11, then th...
متن کاملHigh-Level Counterexamples for Probabilistic Automata
Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system’s states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.020